منابع مشابه
Semidefinite programming for N-Player Games
We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the second problem is a 2-player zero-sum polynomial game in randomized strategies and with compact basic semi-algebraic pure strategy sets. It is proved that their optimal solution can be approximated by solving a hierarchy of semi...
متن کاملThe Mechanics of n-Player Differentiable Games
The cornerstone underpinning deep learning is the guarantee that gradient descent on an objective converges to local minima. Unfortunately, this guarantee fails in settings, such as generative adversarial nets, where there are multiple interacting losses. The behavior of gradient-based methods in games is not well understood – and is becoming increasingly important as adversarial and multiobjec...
متن کاملPreemption Games: Theory and Experiment
Several impatient investors with private costs Ci face an indivisible irreversible investment opportunity whose value V is governed by geometric Brownian motion. The first investor i to seize the opportunity receives the entire payoff, V −Ci. We characterize the symmetric Bayesian Nash equilibrium for this game. A laboratory experiment confirms the model’s main qualitative predictions: competit...
متن کاملPreemption games under Lévy uncertainty
We study a stochastic version of Fudenberg–Tirole’s preemption game. Two firms contemplate entering a new market with stochastic demand. Firms differ in sunk costs of entry. If the demand process has no upward jumps, the low cost firm enters first, and the high cost firm follows. If leader’s optimization problem has an interior solution, the leader enters at the optimal threshold of a monopolis...
متن کاملPotential competition in preemption games
We consider a preemption game with two potential competitors who come into play at some random secret times. The presence of a competitor is revealed to a player only when the former moves, which terminates the game. We show that all perfect Bayesian equilibria give rise to the same distribution of players’ moving times. Moreover, there exists a unique perfect Bayesian equilibrium in which each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2008
ISSN: 1556-5068
DOI: 10.2139/ssrn.968427